TSTP Solution File: SET619^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET619^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:07:38 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of formulae : 61 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 351 ( 85 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 453 ( 69 ~; 107 |; 63 &; 209 @)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 34 ( 20 ^ 8 !; 4 ?; 34 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_10,type,
sK0: a > $o ).
thf(func_def_11,type,
sK1: a > $o ).
thf(func_def_13,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
sK4: a ).
thf(f108,plain,
$false,
inference(avatar_sat_refutation,[],[f95,f96,f100,f101,f104,f107]) ).
thf(f107,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f106]) ).
thf(f106,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f105]) ).
thf(f105,plain,
( ( $false = $true )
| ~ spl2_1
| ~ spl2_3 ),
inference(backward_demodulation,[],[f75,f83]) ).
thf(f83,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f81]) ).
thf(f81,plain,
( spl2_3
<=> ( $false
= ( sK1 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
thf(f75,plain,
( ( ( sK1 @ sK4 )
= $true )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f73]) ).
thf(f73,plain,
( spl2_1
<=> ( ( sK1 @ sK4 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f104,plain,
( ~ spl2_2
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f103]) ).
thf(f103,plain,
( $false
| ~ spl2_2
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f102]) ).
thf(f102,plain,
( ( $false = $true )
| ~ spl2_2
| ~ spl2_4 ),
inference(forward_demodulation,[],[f87,f79]) ).
thf(f79,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f77]) ).
thf(f77,plain,
( spl2_2
<=> ( $false
= ( sK0 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f87,plain,
( ( ( sK0 @ sK4 )
= $true )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f85]) ).
thf(f85,plain,
( spl2_4
<=> ( ( sK0 @ sK4 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
thf(f101,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f22,f85,f81]) ).
thf(f22,plain,
( ( ( sK0 @ sK4 )
= $true )
| ( $false
= ( sK1 @ sK4 ) ) ),
inference(not_proxy_clausification,[],[f21]) ).
thf(f21,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ( ( ~ ( sK0 @ sK4 ) )
= $false ) ),
inference(duplicate_literal_removal,[],[f20]) ).
thf(f20,plain,
( ( ( ~ ( sK0 @ sK4 ) )
= $false )
| ( $false
= ( sK1 @ sK4 ) )
| ( $false
= ( sK1 @ sK4 ) ) ),
inference(binary_proxy_clausification,[],[f19]) ).
thf(f19,plain,
( ( $false
= ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) ) )
| ( $false
= ( sK1 @ sK4 ) ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f17,plain,
( ( $false
= ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) ) )
| ( $false
= ( sK1 @ sK4 ) ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ( $false
= ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
( ( $false
= ( ( sK1 @ sK4 )
| ( sK0 @ sK4 ) ) )
| ( $false
= ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f11,plain,
( ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) )
!= ( ( sK1 @ sK4 )
| ( sK0 @ sK4 ) ) ),
inference(beta_eta_normalization,[],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
@ sK4 )
!= ( ^ [Y0: a] :
( ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) )
@ sK4 ) ),
inference(negative_extensionality,[],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] :
( ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] :
( ( ( X1 @ Y0 )
& ~ ( X0 @ Y0 ) )
| ( ( X0 @ Y0 )
& ( X1 @ Y0 ) )
| ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) )
=> ( ( ^ [Y0: a] :
( ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] :
( ( ( X1 @ Y0 )
& ~ ( X0 @ Y0 ) )
| ( ( X0 @ Y0 )
& ( X1 @ Y0 ) )
| ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] :
( ( ( X1 @ Y0 )
& ~ ( X0 @ Y0 ) )
| ( ( X0 @ Y0 )
& ( X1 @ Y0 ) )
| ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ^ [X2: a] :
( ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) )
| ( ( X1 @ X2 )
& ( X0 @ X2 ) )
| ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) ) ) )
= ( ^ [X3: a] :
( ( X0 @ X3 )
| ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o] :
( ( ^ [X2: a] :
( ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) )
| ( ( X0 @ X2 )
& ( X1 @ X2 ) )
| ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) )
= ( ^ [X2: a] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o] :
( ( ^ [X2: a] :
( ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) )
| ( ( X0 @ X2 )
& ( X1 @ X2 ) )
| ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) )
= ( ^ [X2: a] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.UsPnpUF9rn/Vampire---4.8_19993',cBOOL_PROP_95_pme) ).
thf(f100,plain,
( spl2_2
| spl2_3 ),
inference(avatar_split_clause,[],[f24,f81,f77]) ).
thf(f24,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $false
= ( sK1 @ sK4 ) ) ),
inference(duplicate_literal_removal,[],[f23]) ).
thf(f23,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $false
= ( sK1 @ sK4 ) )
| ( $false
= ( sK1 @ sK4 ) ) ),
inference(binary_proxy_clausification,[],[f18]) ).
thf(f18,plain,
( ( $false
= ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) )
| ( $false
= ( sK1 @ sK4 ) ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f96,plain,
( spl2_2
| spl2_1 ),
inference(avatar_split_clause,[],[f37,f73,f77]) ).
thf(f37,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( ( sK1 @ sK4 )
= $true ) ),
inference(not_proxy_clausification,[],[f36]) ).
thf(f36,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $false
= ( ~ ( sK1 @ sK4 ) ) ) ),
inference(duplicate_literal_removal,[],[f35]) ).
thf(f35,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $false
= ( sK0 @ sK4 ) )
| ( $false
= ( ~ ( sK1 @ sK4 ) ) ) ),
inference(binary_proxy_clausification,[],[f27]) ).
thf(f27,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $false
= ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f14,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $false
= ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f95,plain,
( spl2_4
| spl2_1 ),
inference(avatar_split_clause,[],[f49,f73,f85]) ).
thf(f49,plain,
( ( ( sK0 @ sK4 )
= $true )
| ( ( sK1 @ sK4 )
= $true ) ),
inference(duplicate_literal_removal,[],[f48]) ).
thf(f48,plain,
( ( ( sK0 @ sK4 )
= $true )
| ( ( sK0 @ sK4 )
= $true )
| ( ( sK1 @ sK4 )
= $true ) ),
inference(binary_proxy_clausification,[],[f46]) ).
thf(f46,plain,
( ( $true
= ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) )
| ( ( sK0 @ sK4 )
= $true )
| ( ( sK1 @ sK4 )
= $true ) ),
inference(duplicate_literal_removal,[],[f45]) ).
thf(f45,plain,
( ( $true
= ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) )
| ( ( sK0 @ sK4 )
= $true )
| ( ( sK1 @ sK4 )
= $true )
| ( ( sK1 @ sK4 )
= $true ) ),
inference(binary_proxy_clausification,[],[f43]) ).
thf(f43,plain,
( ( ( sK0 @ sK4 )
= $true )
| ( ( sK1 @ sK4 )
= $true )
| ( $true
= ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) ) )
| ( $true
= ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) ) ),
inference(binary_proxy_clausification,[],[f42]) ).
thf(f42,plain,
( ( ( sK0 @ sK4 )
= $true )
| ( ( sK1 @ sK4 )
= $true )
| ( ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) )
= $true ) ),
inference(duplicate_literal_removal,[],[f41]) ).
thf(f41,plain,
( ( ( sK1 @ sK4 )
= $true )
| ( ( sK0 @ sK4 )
= $true )
| ( ( sK0 @ sK4 )
= $true )
| ( ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f40]) ).
thf(f40,plain,
( ( ( ( sK1 @ sK4 )
| ( sK0 @ sK4 ) )
= $true )
| ( ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) )
= $true )
| ( ( sK0 @ sK4 )
= $true ) ),
inference(binary_proxy_clausification,[],[f38]) ).
thf(f38,plain,
( ( $true
= ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) )
| ( ( ( sK1 @ sK4 )
| ( sK0 @ sK4 ) )
= $true )
| ( ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( ( ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) )
| ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) )
= $true )
| ( ( ( sK1 @ sK4 )
| ( sK0 @ sK4 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET619^5 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 16:28:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH0_THM_EQU_NAR problem
% 0.15/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.UsPnpUF9rn/Vampire---4.8_19993
% 0.15/0.39 % (20182)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.39 % (20181)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.15/0.39 % (20184)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.15/0.39 % (20180)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.15/0.39 % (20183)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.39 % (20186)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.15/0.39 % (20185)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.15/0.39 % (20179)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.15/0.39 % (20182)Instruction limit reached!
% 0.15/0.39 % (20182)------------------------------
% 0.15/0.39 % (20182)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (20182)Termination reason: Unknown
% 0.15/0.39 % (20183)Instruction limit reached!
% 0.15/0.39 % (20183)------------------------------
% 0.15/0.39 % (20183)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (20183)Termination reason: Unknown
% 0.15/0.39 % (20183)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (20183)Memory used [KB]: 5500
% 0.15/0.39 % (20183)Time elapsed: 0.004 s
% 0.15/0.39 % (20183)Instructions burned: 2 (million)
% 0.15/0.39 % (20183)------------------------------
% 0.15/0.39 % (20183)------------------------------
% 0.15/0.39 % (20182)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (20182)Memory used [KB]: 5500
% 0.15/0.39 % (20182)Time elapsed: 0.004 s
% 0.15/0.39 % (20182)Instructions burned: 2 (million)
% 0.15/0.39 % (20182)------------------------------
% 0.15/0.39 % (20182)------------------------------
% 0.15/0.39 % (20186)Refutation not found, incomplete strategy
% 0.15/0.39 % (20186)------------------------------
% 0.15/0.39 % (20186)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (20186)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (20186)Memory used [KB]: 5500
% 0.15/0.39 % (20186)Time elapsed: 0.004 s
% 0.15/0.39 % (20186)Instructions burned: 2 (million)
% 0.15/0.39 % (20186)------------------------------
% 0.15/0.39 % (20186)------------------------------
% 0.15/0.39 % (20181)First to succeed.
% 0.15/0.39 % (20184)Also succeeded, but the first one will report.
% 0.15/0.39 % (20181)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for Vampire---4
% 0.15/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.15/0.39 % (20181)------------------------------
% 0.15/0.39 % (20181)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (20181)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (20181)Memory used [KB]: 5500
% 0.15/0.39 % (20181)Time elapsed: 0.007 s
% 0.15/0.39 % (20181)Instructions burned: 4 (million)
% 0.15/0.39 % (20181)------------------------------
% 0.15/0.39 % (20181)------------------------------
% 0.15/0.39 % (20178)Success in time 0.005 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------